Complexity of Hamiltonian Cycle Reconfiguration
نویسندگان
چکیده
منابع مشابه
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, along with the hypergraph Perfect Matching problems, exceedingly hard, and there is a renewed algorithmic interest in them. In this paper we design a polynomial time algorithm for the Hamiltonian Cycle problem for k-uniform hyper...
متن کاملComplexity of the Hamiltonian Cycle Problem in Triangular Grid Graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. We show that the problem Hamiltonian Cycle is NP-complete for triangular grid graphs, while a hamiltonian cycle in connected, locally connected triangular grid graph can be found in polynomial time. 2000 Mathematics Subject Classification: 05C38 (05C45, 68Q25).
متن کاملComplexity One Hamiltonian
We consider compact connected six dimensional symplectic mani-folds with Hamiltonian SU(2) or SO(3) actions with cyclic principal stabilizers. We classify such manifolds up to equivariant symplectomorphisms.
متن کاملQuantum Hamiltonian Complexity
Constraint satisfaction problems are a central pillar of modern computational complexity theory. This survey provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint satisfaction problems. Over the past decade and a half, this field has witnessed fundamental breakthroughs, ranging from the establishment of a “Quantum...
متن کاملCycle spectra of Hamiltonian graphs
We prove that every Hamiltonian graph with n vertices and m edges has cycles of at least √ 4 7(m − n) different lengths. The coefficient 4/7 cannot be increased above 1, since when m = n2/4 there are √ m − n + 1 cycle lengths in Kn/2,n/2. For general m and n there are examples having at most 2 ⌈
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2018
ISSN: 1999-4893
DOI: 10.3390/a11090140